On two-way nondeterministic finite automata with one reversal-bounded counter
نویسندگان
چکیده
منابع مشابه
On two-way nondeterministic finite automata with one reversal-bounded counter
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e., the counter alternates between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e., subsets of for some nonnull words ) is decidable, resolving a problem left open in [4,7]. The proof is a rather involved reduction to ...
متن کاملOn the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e., the counter alternates between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e., subsets of w 1 : : : w k for some nonnull words w1; : : : ; wk) is decidable, settling an open problem in [11, 12]. The proof is a rat...
متن کاملPath-Bounded One-Way Multihead Finite Automata
For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of pathbounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k ≥ 2 and r ≥ 1, there is a language accepted by an (r+1) path-bounded one-way nondeterministic k head f...
متن کاملTwo-way Quantum One-counter Automata
After the rst treatments of quantum nite state automata by Moore and Crutch eld and by Kondacs and Watrous, a number of papers study the power of quantum nite state automata and their variants. This paper introduces a model of two-way quantum one-counter automata (2Q1CAs), combining the model of two-way quantum nite state automata (2QFAs) by Kondacs and Watrous and the model of one-way quantum ...
متن کاملNondeterminism is essential for reversal-bounded two-way multihead finite automata
It is proved for some "nice" function / that/(fl)-reversal-bounded two-way nondeterministic finite automata are more powerful than /(n)-reversal-bounded two-way deterministic ones. This solves a simplified extension of the well-known DLOG ? NLOG problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.09.010